Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PROGRAM SCHEMATE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 224

  • Page / 9
Export

Selection :

  • and

NATURAL PROPERTIES OF FLOWCHART STEP-COUNTING MEASURES.BAKER TP.1978; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1978; VOL. 16; NO 1; PP. 1-22; BIBL. 11 REF.Article

LOGIQUES A PROGRAMMESPLYUSHKYAVICHYUS RA; PLYUSHKYAVICHENE A YU; SAKALAUSKAJTE YU V et al.1979; KIBERNETIKA; UKR; DA. 1979; NO 2; PP. 12-19; ABS. ENG; BIBL. 31 REF.Article

EQUIVALENCE SEMANTIQUE DES SCHEMAS DE PROGRAMME ET SON EXPRESSION SYNTACTIQUE.GUESSARIAN I.sdIN: THEOR. ALGORITHMES LANG. PROGRAMMATION. SEMIN.; ROCQUENCOURT; 1974-1975; ROCQUENCOURT; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 29-32; ABS. ANGL.; BIBL. 1 REF.Conference Paper

CONTROL STRUCTURE ABSTRACTIONS OF THE BACKTRACKING PROGRAMMING TECHNIQUE.GERHART SL; YELOWITZ L.1976; I.E.E.E. TRANS. SOFTWARE ENGNG; U.S.A.; DA. 1976; VOL. 2; NO 4; PP. 285-292; BIBL. 17 REF.Article

ANALYSE DES COLLECTIFS D'ALGORITHMESKRINITSKIJ VN; KRINITSKIJ NA.1982; PROGRAMMIROVANIE; SUN; DA. 1982; NO 2; PP. 3-17; BIBL. 6 REF.Article

CADRES DE CALCUL ET SYNTHESE STRUCTUREE DES PROGRAMMESTYUGU EH KH.1982; IZVESTIJA AKEDEMII NAUK SSSR. TEHNICESKAJA KIBERNETIKA; ISSN 0002-3388; SUN; DA. 1982; NO 6; PP. 176-182; BIBL. 4 REF.Article

SUR LA COMPLETUDE APPROXIMATIVE D'UN SYSTEME DE TRANSFORMATIONS EQUIVALENTES DE SCHEMASKRINITSKIJ NA.1982; PROGRAMMIROVANIE; ISSN 508098; SUN; DA. 1982; NO 3; PP. 3-9; BIBL. 5 REF.Article

SUR UNE METHODE DE REALISATION DES SCHEMAS DE TRADUCTION REGIE PAR LA SYNTAXESTEPANOV AN; POPOV YU A.1982; PROGRAMMIROVANIE; ISSN 508098; SUN; DA. 1982; NO 4; PP. 54-62; BIBL. 9 REF.Article

ALGEBRAIC SEMANTICS OF RECURSIVE FLOWCHART SCHEMESSCHMECK H.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 489-501; BIBL. 2 P.Conference Paper

REDUCTIBILITE A DES SCHEMAS LIBRESNIGIYAN SA.1980; PROGRAMMIROVANIE; SUN; DA. 1980; NO 4; PP. 14-19; BIBL. 4 REF.Article

A NEW HYBRID SCHEME FOR CPMRAGHU D.1979; J. INSTIT. ENGRS (INDIAN), MECH. ENGNG DIV.; IND; DA. 1979; VOL. 59; NO 6; PP. 257-259; BIBL. 2 REF.Article

ALGEBRAIC AND GRAPH THEORETIC CHARACTERIZATIONS OF STRUCTURED FLOWCHART SCHEMESBLOOM SL; TINDELL R.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 3; PP. 265-286; BIBL. 6 REF.Article

EQUIVALENCE FONCTIONNELLE DES SCHEMAS STANDARDS AVEC DES SOMMETS DE BOUCLESBUDA AO.1978; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1978; NO 1; PP. 10-23; ABS. ANGL.; BIBL. 7 REF.Article

PROCESSEURS RECURSIFS SUR UNE MEMOIREANISIMOV AV.1978; KIBERNETIKA; UKR; DA. 1978; NO 6; PP. 16-26; ABS. ENG; BIBL. 34 REF.Article

THE EQUIVALENCE PROBLEM FOR PROGRAM SCHEMATA WITH NONINTERSECTING LOOPS.LEWIS HR.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES; 1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. 253-266; BIBL. 3 REF.Conference Paper

PROBLEME D'ALLOCATION DE MEMOIRE DANS LES SCHEMAS D'OPERATEURS EN PRESENCE DE PLUSIEURS MEMOIRES DE DIFFERENTS NIVEAUXDIMITROVA LP.1977; PROGRAMMIROVANIE; S.S.S.R.; DA. 1977; NO 6; PP. 19-28; BIBL. 6 REF.Article

TRANSFORMATION DES R-SCHEMAS D'OPERATEURS EN SCHEMAS DE YANOVBORISENKO VI.1977; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1977; NO 4; PP. 22-26; ABS. ANGL.; BIBL. 7 REF.Article

PROGRAM EQUIVALENCE AND CANONICAL FORMS IN STABLE DISCRETE INTERPRETATIONS.BERRY G; COURCELLE B.sdIN: JOURN. ET. SCHEMAS PROGRAMME SEMANTIQUE LANG. PROGRAMMATION; MOLINES EN QUEYRAS; 1976; S.L.; DA. S.D.; PP. 1-21; BIBL. 13 REF.Conference Paper

ON THE COMPLEXITY OF SIMPLE ARITHMETIC EXPRESSIONSIBARRA OH; LEININGER BS; MORAN S et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 17-28; BIBL. 9 REF.Article

THE INDEPENDENCE OF CONTROL STRUCTURES IN PROGRAMMABLE NUMBERINGS OF THE PARTIAL RECURSIVE FUNCTIONSRICCARDI GA.1982; Z. MATH. LOGIK GRUNDL. MATH.; ISSN 0044-3050; DDR; DA. 1982; VOL. 28; NO 4; PP. 285-296; BIBL. 15 REF.Article

TRANSFORMATIONS EQUIVALENTES DES SCHEMAS MULTIPLESKAS'YANOV VN.1982; PROGRAMMIROVANIE; ISSN 508098; SUN; DA. 1982; NO 6; PP. 3-8; BIBL. 6 REF.Article

GENERALIZATIONS OF PETRI NETSVALK R.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 140-155; BIBL. 28 REF.Conference Paper

PROBLEME DE REALISATION DES CYCLES COMPOSITESLYUBIMSKIJ EH Z; MITASHYUNAS A YU.1981; PROGRAMMIROVANIE; SUN; DA. 1981; NO 1; PP. 34-41; BIBL. 3 REF.Article

DEFINABILITY IN DYNAMIC LOGICMEYER AR; PARIKH R.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 1-9; BIBL. 9 REF.Conference Paper

SCHEMES FOR NONSEQUENTIAL PROCESSING SYSTEMSREISIG W.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 515-527; BIBL. 8 REF.Conference Paper

  • Page / 9